Evaluation of interval extension of the power function by graph decomposition

نویسنده

  • Evgueni Petrov
چکیده

The subject of our talk is the correct evaluation of interval extension of the function specified by the expression x. Despite the fact that the algorithms which calculate interval extensions of the basic mathematical functions are well known (the algorithms which do the arithmetic operations on intervals are even patented in the USA), at present, there is no systematic approach to evaluation of interval extension of the power function. The existing packages of mathematical software for interval calculations allow one to calculate interval extension of the power function but constrain the values of the variables x и y. The most common constraints are x ∈ R, y ∈Z and x ∈ R+=[0, ∞), y ∈ R. The presence of such constraints complicates the use of interval software for reliable solution of mathematical modeling problems. First, these artificial constraints complicate solution of problems with unknown power exponent. Second, these constraints complicate the use of interval software in cooperation with symbolic preprocessors of mathematical models. For example, replacing x=const with x=const is not a valid symbolic transformation for the power function defined only for positive bases. Most likely, such constraints on evaluation of the power function emerge from a cautious attitude of the developers of interval software to discontinuous functions: the power function, as a function of two variables, is discontinuous (or undefined) at every point (x, y) where the base x is negative. In fact, the constraints artificially set for the values of x and y, specify the domains where the power function is continuous. The goal for the research which is the subject of our talk was development of a systematic approach to the correct evaluation of interval extension of the power function x without any constraints on the values of x and y. The approach which we have developed is used for implementation of the power function in the UniCalc system [1]. The core of our approach is a decomposition of the graph of the function x into a small number of parts which can be transformed, by reflections with respect to coordinate planes, into subsets of the graph of x for non-negative bases x. By construction, the closure of each such subset is the entire graph of x (in the topology of Euclidean space R). Because of this fact, evaluation of interval extension of x without any constraints on the values of x and y, is not much harder than evaluation of interval extension of x for nonnegative bases x. We consider x as a restriction of the power function of complex variables calculated for the principal branch of the argument arg(x) ∈ [0, 2⋅π): x = |x|⋅(cos(y⋅arg(x))+i⋅sin(y⋅arg(x))) for x≠0, 0=0 for positive y, 0=1. It is easy to see that the function specified this way takes real values (i.e., sin(y⋅arg(x))=0) only in the following cases: • y is an irreducible fraction with odd denominator, x ∈ R; • y is an irreducible fraction with even denominator (and odd numerator), x ∈ R+; • y is an irrational number, x ∈ R+. We decompose the graph of x into the following parts: • y is an irreducible fraction with odd denominator and even numerator; • y is an irreducible fraction with odd denominator and numerator; • y is an irreducible fraction with even denominator, x ∈ R+; • y is an irrational number, x ∈ R+. Denote by X the image of the Cartesian product of the sets (not necessarily intervals) X ∩ R+ and Y under the power function. Denote by Yeo, Yoo, Yoe, Yir the subsets of Y which consist, respectively, of the irreducible fractions with odd denominator and even numerator, odd denominator and numerator, even numerator, and irrational numbers. According to our decomposition of the entire graph of x, the image of the box (x, y) under the power function is x ∪ (–x) ∪ x ∪ –(–x) ∪ x ∪ x. After an obvious reduction, this expression becomes x ∪ (–x) ∪ –(–x). Note that, if y is a non-singleton interval, then the closure of the sets yeo and yoo is the entire interval y. Denote by p0(x, y) interval extension of the power function x y for non-negative base. Taking into account the considerations from the previous paragraph, interval extension p(x, y) of the power function, without constraints on the values of x and y, is expressed in terms p0 of as follows: • p(x, y)= p0(x, y) ∪ p0(–x, y) ∪ –p0(–x, y), if y is a non-singleton interval ; • p(x, y)= p0(x, y) ∪ p0(–x, y), if y is a singleton interval which contains an irreducible fraction of the form “even/odd”; • p(x, y)= p0(x, y) ∪ –p0(–x, y), if y is a singleton interval which contains an irreducible fraction of the form “odd/odd”; • p(x, y)= p0(x, y), if y is a singleton interval which contains an irrational number. Of practical interest is the restriction pf(x, y) of interval extension p(x, y) of the power function to the set of intervals having computer representable bounds. Because the set of computer representable real numbers does not contain any irrational numbers or irreducible fractions with an odd denominator different from 1 and –1, the following equations hold: • pf (x, y)= p0(x, y) ∪ p0(–x, y) ∪ –p0(–x, y), if y is a non-singleton interval; • pf (x, y)= p0(x, y) ∪ p0(–x, y), if y is a singleton interval containing an even integer; • pf (x, y)= p0(x, y) ∪ –p0(–x, y), if y is a singleton interval containing an odd integer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerating the Composite Power System Planning by Benders Decomposition

This paper presents an application of Benders decomposition to deal with the complexities in the simultaneous Generation Expansion Planning (GEP) and Transmission Expansion Planning (TEP). Unlike the power system operation fields of study, the power system planning methods are not expected to be fast. However, it is always preferable to speed up computations to provide more analysis options for...

متن کامل

The Main Eigenvalues of the Undirected Power Graph of a Group

The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue $lambda$ of $A$ is a main eigenvalue if the eigenspace $epsilon(lambda)$ has an eigenvector $X$ such that $X^{t}jjneq 0$, where $jj$ is the all-one...

متن کامل

A contribution to approximate analytical evaluation of Fourier series via an Applied Analysis standpoint; an application in turbulence spectrum of eddies

In the present paper, we shall attempt to make a contribution to approximate analytical evaluation of the harmonic decomposition of an arbitrary continuous function. The basic assumption is that the class of functions that we investigate here, except the verification of Dirichlet's principles, is concurrently able to be expanded in Taylor's representation, over a particular interval of their do...

متن کامل

Distinct edge geodetic decomposition in graphs

Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...

متن کامل

Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0603052  شماره 

صفحات  -

تاریخ انتشار 2006